Multiobjective Genetic Algorithm for a Graph Drawing Problem
نویسنده
چکیده
In this paper we introduce an application of multiobjective optimization with genetic algorithms to the problem of graph drawing and explore the potential contribution of the genetic algorithm to solve this particular problem. Given a weighted graph, we want to find a geometric position of every vertex (layout) consistent with the weights in the graph. Among the possible solutions to this problem, we would also like to find one that follows a particular given shape or that has some geometric properties. Our paper shows that the genetic algorithms can help find an optimal solution both in terms of consistency and of shape.
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملOptimal Power Flow With Four Conflicting Objective Functions Using Multiobjective Ant Lion Algorithm: A Case Study of the Algerian Electrical Network
In this study, a multiobjective optimization is applied to Optimal Power Flow Problem (OPF). To effectively achieve this goal, a Multiobjective Ant Lion algorithm (MOALO) is proposed to find the Pareto optimal front for the multiobjective OPF. The aim of this work is to reach good solutions of Active and Reactive OPF problem by optimizing 4-conflicting objective functions simultaneously. Here a...
متن کامل